Goéland: A Concurrent Tableau-Based Theorem Prover (System Description)

Abstract We describe , an automated theorem prover for first-order logic that relies on a concurrent search procedure to find tableau proofs, with processes corresponding individual branches of the tableau. Since branch closure may require instantiating free variables shared across branches, communicate via channels exchange information about substitutions used closure. present proof and its implementation, as well experimental results obtained problems from TPTP library.